Reliable access to massive restricted texts: Experience‐based evaluation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliable Restricted Process Theory

Malfunctions of a mobile ad hoc network (MANET) protocol caused by a conceptual mistake in the protocol design, rather than unreliable communication, can often be detected only by considering communication among the nodes in the network to be reliable. In Restricted Broadcast Process Theory, which was developed for the specification and verification of MANET protocols, the communication operato...

متن کامل

Restricted Access to Myeloid Cells Explained

The lentiviral accessory protein, Vpx, is known to counteract a restriction factor that is specific to myeloid cells, such as macrophages and dendritic cells. This review summarizes the findings in two seminal studies that identify SAMHD1 as the cellular protein that is responsible for myeloid cell restriction, and establish the existence of other types of restriction in these cells.

متن کامل

PCFG Parsing for Restricted Classical Chinese Texts

The Probabilistic Context-Free Grammar (PCFG) model is widely used for parsing natural languages, including Modern Chinese. But for Classical Chinese, the computer processing is just commencing. Our previous study on the part-of-speech (POS) tagging of Classical Chinese is a pioneering work in this area. Now in this paper, we move on to the PCFG parsing of Classical Chinese texts. We continue t...

متن کامل

User Collaboration for Improving Access to Historical Texts

The paper will describe how web-based collaboration tools can engage users in the building of historical printed text resources created by mass digitisation projects. The drivers for developing such tools will be presented, identifying the benefits that can be derived for both the user community and cultural heritage institutions. The perceived risks, such as new errors introduced by the users,...

متن کامل

Reliable and Restricted Quickest Path Problems

In a dynamic network, the quickest path problem asks for a path minimizing the time needed to send a given amount of flow from source to sink along this path. In practical settings, for example in evacuation or transportation planning, the reliability of network arcs depends on the specific scenario of interest. In this circumstance, the question of finding a quickest path among all those havin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Concurrency and Computation: Practice and Experience

سال: 2019

ISSN: 1532-0626,1532-0634

DOI: 10.1002/cpe.5255